منابع مشابه
Quantitatively fair scheduling
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infinite path where either (i) all colors occur with a fixed asymptotic frequency, (ii) there is a constant that bounds the difference between the occurrences of any two colors for all prefixes of the path. These properties c...
متن کاملEarly-release fair scheduling
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling di ers from Pfair scheduling in that it is work conserving. As a result, average job response times may be muc...
متن کاملFair Airport Scheduling Algorithms
We design a class of Fair Airport (FA) algorithms that combines Start-time Fair Queuing with a non-work conserving algorithm in the Rate Controlled Service Discipline (RCSD) class. We derive the fairness and deadline guarantees for FA servers. We demonstrate that by appropriately choosing an algorithm from the RCSD class, algorithms that either allocate only rate or achieve separation of rate a...
متن کاملQuick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address this shortcoming by proposing a new notion of multiprocessor fairness, called quick-release fair (QRfair) scheduling, which is a derivative of Pfair scheduling that allows efficient allocation of spare capacity. Under QRf...
متن کاملFair Scheduling in Broadcast Environments
This report considers the problems of scheduling transmissions in broadcast environments, including, wireless environments. Issues that affect the design of fair scheduling algorithms, and several alternative approaches to implementing fair scheduling in single-hop and multi-hop environments are identified.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.029